A mixture model for pose clustering
نویسندگان
چکیده
This paper describes a structural method for object alignment by pose clustering. The idea underlying pose clustering is to decompose the objects under consideration into k-tuples of primitive parts. By bringing pairs of k-tuples into correspondence, sets of alignment parameters are estimated. The global alignment corresponds to the set of parameters with maximum votes. The work reported here oers two novel contributions. Firstly, we impose structural constraints on the arrangement of the k-tuples of primitives used for pose clustering. This limits problems of combinatorial nature and eases the search for consistent pose clusters. Secondly, we use the EM algorithm to estimate maximum likelihood alignment parameters. Here we ®t a mixture model to the set of transformation parameter votes. We control the order of the underlying mixture model using a minimum description length criterion. The new alignment method is illustrated on the matching of optical and radar images of aerial scenes. Ó 1999 Published by Elsevier Science B.V. All rights
منابع مشابه
Extracting Prior Knowledge from Data Distribution to Migrate from Blind to Semi-Supervised Clustering
Although many studies have been conducted to improve the clustering efficiency, most of the state-of-art schemes suffer from the lack of robustness and stability. This paper is aimed at proposing an efficient approach to elicit prior knowledge in terms of must-link and cannot-link from the estimated distribution of raw data in order to convert a blind clustering problem into a semi-supervised o...
متن کاملOn Model-Based Clustering, Classification, and Discriminant Analysis
The use of mixture models for clustering and classification has burgeoned into an important subfield of multivariate analysis. These approaches have been around for a half-century or so, with significant activity in the area over the past decade. The primary focus of this paper is to review work in model-based clustering, classification, and discriminant analysis, with particular attenti...
متن کاملA Nonparametric Statistical Approach to Clustering via Mode Identification
In this paper, we develop a mode-based clustering approach applying new optimization techniques to a nonparametric density estimator. A cluster is formed by those sample points that ascend to the same local maximum (mode) of the density function. The path from a point to its associated mode is efficiently solved by an EM-style algorithm, namely, the Modal EM (MEM). This clustering method shares...
متن کاملGrabCut-Based Human Segmentation in Video Sequences
In this paper, we present a fully-automatic Spatio-Temporal GrabCut human segmentation methodology that combines tracking and segmentation. GrabCut initialization is performed by a HOG-based subject detection, face detection, and skin color model. Spatial information is included by Mean Shift clustering whereas temporal coherence is considered by the historical of Gaussian Mixture Models. Moreo...
متن کاملClustering with Hidden Markov Model on Variable Blocks
Large-scale data containing multiple important rare clusters, even at moderately high dimensions, pose challenges for existing clustering methods. To address this issue, we propose a new mixture model called Hidden Markov Model on Variable Blocks (HMM-VB) and a new mode search algorithm called Modal Baum-Welch (MBW) for mode-association clustering. HMM-VB leverages prior information about chain...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Pattern Recognition Letters
دوره 20 شماره
صفحات -
تاریخ انتشار 1999